Legendre - Stirling Permutations ∗ Eric
نویسنده
چکیده
We first give a combinatorial interpretation of Everitt, Littlejohn, and Wellman’s Legendre-Stirling numbers of the first kind. We then give a combinatorial interpretation of the coefficients of the polynomial (1 − x) ∑∞ n=0 { n+k n } x analogous to that of the Eulerian numbers, where { n k } are Everitt, Littlejohn, and Wellman’s Legendre-Stirling numbers of the second kind. Finally we use a result of Bender to show that the limiting distribution of these coefficients as n approaches infinity is the normal distribution.
منابع مشابه
The Legendre-Stirling numbers
The Legendre-Stirling numbers are the coeffi cients in the integral Lagrangian symmetric powers of the classical Legendre second-order differential expression. In many ways, these numbers mimic the classical Stirling numbers of the second kind which play a similar role in the integral powers of the classical second-order Laguerre differential expression. In a recent paper, Andrews and Littlejoh...
متن کاملCombinatorial Interpretations of Particular Evaluations of Complete and Elementary Symmetric Functions
The Jacobi-Stirling numbers and the Legendre-Stirling numbers of the first and second kind were first introduced by Everitt et al. (2002) and (2007) in the spectral theory. In this paper we note that Jacobi-Stirling numbers and Legendre-Stirling numbers are specializations of elementary and complete symmetric functions. We then study combinatorial interpretations of this specialization and obta...
متن کاملA Combinatorial Interpretation of the Legendre-stirling Numbers
The Legendre-Stirling numbers were discovered in 2002 as a result of a problem involving the spectral theory of powers of the classical secondorder Legendre differential expression. Specifically, these numbers are the coefficients of integral composite powers of the Legendre expression in Lagrangian symmetric form. Quite remarkably, they share many similar properties with the classical Stirling...
متن کاملEnumeration formulæ for pattern restricted Stirling permutations
We classify k-Stirling permutations avoiding a set of ordered patterns of length three according to Wilf-equivalence. Moreover, we derive enumeration formulæ for all of the classes using a variety of techniques such as the kernel method, a bijection related to a classical result of Simion and Schmidt, and also structural decompositions of k-Stirling permutations via the so-called block decompos...
متن کاملEulerian Polynomials, Stirling Permutations of the Second Kind and Perfect Matchings
In this paper, we introduce Stirling permutations of the second kind. In particular, we count Stirling permutations of the second kind by their cycle ascent plateaus, fixed points and cycles. Moreover, we get an expansion of the ordinary derangement polynomials in terms of the Stirling derangement polynomials. Finally, we present constructive proofs of a kind of combinatorial expansions of the ...
متن کامل